import _00GraphFuc as gf
import _000GraphBasicProblem as gb

#11.2.4骑士周游图
n=5
[V,E]=gb.Knighttouregraph(n)
[d,di,do] =gf.degreeset(V,E)
gf.drawgraph(E)
#paths=gb.Hamiltonpath(V,E,v0)
print(V,E)
print(d)